Edge spinning algorithm for implicit surfaces ✩

This paper presents a new fast method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles generated and on the polygonization speed. The main advantages of the triangulation presented are simplicity and the stable features that can be used for future expansion. The implementation is not complicated and only the standard data structures are used. This algorithm is based on the surface tracking scheme and it is compared with the well-known marching cubes algorithm that is based on the similar principle. The presented algorithm is accelerated by the space subdivision which is an effective technique to speed-up any geometric of this type.  2004 IMACS. Published by Elsevier B.V. All rights reserved.